A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
نویسندگان
چکیده
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we propose a new parallel meta heuristic algorithm based on the Tabu Search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynamically the settings of some TS parameters . This last point is realized by analyzing the information given by cooperative parallel search processes, and by modifying the search processes during the execution. This approach introduces a new level where balancing between intensification and diversification
منابع مشابه
A Tabu Search Approach with Double Tabu-List for Multidimensional Knapsack Problems
The knapsack problems are a classic NP-hard problem in the combinational optimization. Inspired by the conclusion of the cognitive psychology about the human memory system, a Tabu Search method based on Double Tabu-List (DTL-TS) has been proposed to solve it. With the addition of the search strategy of intensification and diversification, the excellent experiment results have been gotten. Compa...
متن کاملParallel Skeletons for Tabu Search Method
In this paper we present two generic parallel skeletons for Tabu Search method –a well known meta-heuristic for approximately solving combinatorial optimization problems. The first skeleton is based on independent runs while the second in the classical master-slave model. Our starting point is the design and implementation of a sequential skeleton that is used later as basis for the two paralle...
متن کاملThe COMPSET Algorithm for Subset Selection
Subset selection problems are relevant in many domains. Unfortunately, their combinatorial nature prohibits solving them optimally in most cases. Local search algorithms have been applied to subset selection with varying degrees of success. This work presents COMPSET, a general algorithm for subset selection that invokes an existing local search algorithm from a random subset and its complement...
متن کاملA Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
W consider an extension of the 0–1 multidimensional knapsack problem in which there are greater-thanor-equal-to inequalities, called demand constraints, in addition to the standard less-than-or-equal-to constraints. Moreover, the objective function coefficients are not constrained in sign. This problem is worth considering because it is embedded in models of practical application, it has an int...
متن کاملA hybrid Bee Colony Algorithm by Tabu Search for Multiple Knapsack Problems
In this paper, an enhanced Hybrid artificial bee colony algorithm (HBCT) is proposed to solve combinatorial optimization problems like 0-1 Multidimensional knapsack problem . The aim of MKP is to find a subset of a given set of n objects in such a way that the total profit of the objects included in the subset is maximized, while the total weight of them does not exceed the capacity of the knap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997